Graph Regularized Sparse Coding for Face Hallucination
نویسندگان
چکیده
منابع مشابه
Subspace Clustering via Graph Regularized Sparse Coding
Sparse coding has gained popularity and interest due to the benefits of dealing with sparse data, mainly space and time efficiencies. It presents itself as an optimization problem with penalties to ensure sparsity. While this approach has been studied in the literature, it has rarely been explored within the confines of clustering data. It is our belief that graph-regularized sparse coding can ...
متن کاملFace Recognition using an Affine Sparse Coding approach
Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hen...
متن کاملNew Graph Regularized Sparse Coding Improving Automatic Image Annotation
Typical image classification pipeline for shallow architecture can be summarized by the following three main steps: i) a projection in high dimensional space of local features, ii) sparse constraints for the encoding scheme and iii) a pooling operation to obtain a global representation invariant to common transformation. Sparse Coding (SC) framework is one particular example of this general app...
متن کاملFace Hallucination Using Sparse Representation Algorithm
Face Hallucination is a super-resolution technique to obtain high-resolution facial images by taking low-resolution facial images as input. In this paper problem of face hallucination has been approached by using sparse Representation. The image has to be subdivided into different segments so that image pixel information can be retrieved easily from each segment. Each small patch of the image h...
متن کاملADMM Pursuit for Manifold Regularized Sparse Coding
In this paper, we propose an efficient ADMM-based algorithm for graph regularized sparse coding that explicitly takes into account the local manifold structure of the data. Specifically, the graph Laplacian representing the manifold structure is used as a regularizer, encouraging the resulting sparse codes to vary smoothly along the geodesics of the data manifold. By preserving locality, the ob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2014
ISSN: 1812-5638
DOI: 10.3923/itj.2014.1883.1887